例句與造句

1. Priority scheduling system
   優(yōu)先等系統(tǒng)
2. Stability analysis of buffer priority scheduling policies using timed petri net models
   網(wǎng)模型的緩沖優(yōu)先調(diào)度策略穩(wěn)定性分析
3. In the last chapter two type of tasks : time - triggered and event - driven is distinguished and then a modified full priority schedule algorithm is developed
   如何保證控制器在實時環(huán)境下正常運行，是多任務操作系統(tǒng)必須要解決的問題。
4. Moreover , the paper discuss the application of priority scheduling technology and dynamic load balancing technology in task scheduling and load balancing
   多任務的并發(fā)和協(xié)同工作是分布式必然遇到的基本問題，其調(diào)度算法直接影響著系統(tǒng)的正確性和實時性。
5. 7 shin y , choi k . power conscious fixed priority scheduling for hard real - time systems . in proc . design automation conference , new orleans , louisiana , usa , 1999 , pp . 134 - 139
   從底層的電路技術，到邏輯技術體系結(jié)構(gòu)技術，以及高層的軟件技術，出現(xiàn)了各種全新的方法用于解決系統(tǒng)的功耗問題。
6. It's difficult to find priority scheduling in a sentence. 用priority scheduling造句挺難的
7. In chapter 2 , on the basis of reference to classical static priority scheduling theory for hard real - time systems , we proposed a delay computation method with partition algorithm
   第二章在借鑒強實時系統(tǒng)靜態(tài)優(yōu)先級調(diào)度理論的基礎上，提出一種通過引入分區(qū)算法來計算atm交換延遲的方法。
8. To deal with the difference on operating system level , this paper designs a thread - level algorithm based upon priority inheritance protocol to prevent priority inversion . a dynamic priority mapping and scheduling algorithm to achieve strict order is also presented . through analysis of multi - threaded execution order under fixed priority scheduling model , a multithreaded programming model with totally predicable execution order is proposed
   針對各種操作系統(tǒng)的差異，本文提出了基于優(yōu)先級繼承協(xié)議的線程級防優(yōu)先級翻轉(zhuǎn)算法，提出了能夠嚴格保序的動態(tài)優(yōu)先級映射方法及相關的調(diào)度算法，通過研究固定優(yōu)先級調(diào)度下的多線程執(zhí)行順序問題，本文還提出了一種執(zhí)行順序可預測的多線程程序設計模式。
9. There is a pretty strict limit of reliability , cost , volume and energy - consuming . real - time embedded control system is applied for firm real - time and responding circumstance . aiming at direct current servo electromotor , a set of servo experiment system is designed , exploitation flow and process of real - time embedded control system are advanced , some issues of them are paid much more attention , the satisfied effects are obtained in the real circumstance , these issues include : exploitation of embedded system , analysis of superiority of the exploitation , the exploitation of embedded linux operation system from kernel customizing and file system cutting out to system starting up is researched , some factors which effect the system ' s capability are analyzed , the settled real - time schemes of linux os and the arithmetic of preemptive priority scheduling and round - robin scheduling and latest and rapid arithmetic are researched
   本文圍繞著針對直流伺服電機設計一套伺服試驗系統(tǒng)，對于嵌入式實時控制系統(tǒng)應用技術進行了比較全面的研究，提出了嵌入式實時控制系統(tǒng)的開發(fā)流程和步驟，并對其中的一些問題進行了專門研究，在實物實驗中獲得了比較好的效果，這些問題包括：嵌入式操作系統(tǒng)開發(fā)，分析了使用linux操作系統(tǒng)進行嵌入式操作系統(tǒng)軟件開發(fā)的優(yōu)越性，并且從內(nèi)核定制、文件系統(tǒng)裁剪、系統(tǒng)啟動等幾個方面研究嵌入式linux操作系統(tǒng)的開發(fā)；實時性研究，分析了在操作系統(tǒng)中影響系統(tǒng)實時性能的因素，研究了linux操作系統(tǒng)的幾種實時解決方案，并且研究了基于優(yōu)先級的可搶占式與可選擇的同優(yōu)先級按時間片輪轉(zhuǎn)相結(jié)合的調(diào)度算法以及最遲響應與最快處理的可搶占式調(diào)度算法。
10. The full priority scheduling algorithm generates the scheduling list according to the priority vectors , and only the application which has the highest priority can be submitted while the non - absolute priority scheduling algorithm schedules several independent grid applications so as to compensate the parallelism problem of the full priority scheduling algorithm
    其中，完全優(yōu)先級調(diào)度算法根據(jù)網(wǎng)格工作流中的應用程序優(yōu)先級向量生成調(diào)度序列，而且每次只將隊列中優(yōu)先級最高的應用程序提交給網(wǎng)格，而非完全優(yōu)先級調(diào)度算法可同時調(diào)度若干無依賴的網(wǎng)格應用程序進入網(wǎng)格，以彌補完全優(yōu)先級調(diào)度算法的并行化問題。
11. Experiments show that , when the grid has fewer available resources or the performance discrepancy of the resources is much higher , the full priority scheduling algorithm ensures the workflow applications that have high priority to be scheduled firstly , and when the grid contains more resources that have the same performance , the non - absolute priority scheduling algorithm avoids largely increasing of the workflow ' s makespan caused by resources waste
    實驗表明，當網(wǎng)格中的資源較少且資源的性能差異較大時，使用完全優(yōu)先級調(diào)度算法可以保證優(yōu)先級較高的工作流的應用程序優(yōu)先使用優(yōu)勢資源；當網(wǎng)格中的資源性能差異不大時，非完全優(yōu)先級調(diào)度算法可解決因資源未充分利用而造成工作流完成時間大幅增加的問題。
12. Based on the timely summarization on a tm switch , in the thesis , we have detailed most of the scheduling strategy and improved switch structure relevant to input - queued switches , and by the overall analysis of the cell sending procedure , we presented a system model named time priority scheduling input - line group output with muti - channel model
    在人們對atm交換網(wǎng)絡系統(tǒng)模型綜述的基礎上，本論文綜述了輸入隊列atm交換的調(diào)度策略和各種改進的交換結(jié)構(gòu)，并將時間優(yōu)先級控制方式應用于線群結(jié)構(gòu)輸出的交換機中，通過對信元傳送機理的分析，提出了優(yōu)先級調(diào)度輸入一線群多通道輸出的系統(tǒng)模型。
13. The length or the capacities of the tactical data are always different , and so the conventional data scheduling algorithm which consisted " first in first service " and " shore message first service " are not appropriate in the tactical communication applications . to meet the requirement of the information service priority , we presented a dynamic priority scheduling algorithms , which working on the order programming mode , can improve the efficiency of the asymmetric broadcast channel
    戰(zhàn)場數(shù)據(jù)分發(fā)的長短消息數(shù)據(jù)容量相差懸殊，分析了常規(guī)“先入先服務”及“短消息優(yōu)先”等調(diào)度算法存在的不公平特性，根據(jù)戰(zhàn)術通信對信息服務優(yōu)先權(quán)的特殊要求，提出了一種“動態(tài)優(yōu)先權(quán)”調(diào)度算法，在點播模式下，可提高非對稱廣播信道數(shù)據(jù)的傳輸效率。